LogCEP - Complex Event Processing based on Pushdown Automaton
نویسندگان
چکیده
Complex (or Composite) event processing systems have become more popular in a number of areas. Non-deterministic finite automata (NFA) are frequently used to evaluate CEP queries. However, it is complex or difficult to use the traditional NFA-based method to process patterns with conjunction and negation. In this paper, we proposed a new CEP system LogCEP using pushdown automaton to support efficient processing of conjunction and negation. First, the semantic and query language specification of LogCEP system are presented. Then, an automaton named LogPDA is proposed for query processing in LogCEP system. LogPDA construction method describes how to convert a query to LogPDA automation. The LogPDA execution approach describes how to detect the specified pattern using LogPDA. Meanwhile, most of previous NFA-based optimizations can be employed to improve the evaluation efficiency. Finally, our simulation based experimental results show that our method not only extended the expressibility and processing capability but also didn't lead to efficiency decreasing.
منابع مشابه
Event-Clock Visibly Pushdown Automata
Event-clock automata is a determinizable subclass of timed automata, where the clock valuations are determined by the input instead of by the transition relation. In this note, we propose event-clock visibly pushdown automata (ECVPAs) as a proper extension of event-clock automata. The class of ECVPAs is sufficiently expressive to model real-time pushdown systems, and to specify common non-regul...
متن کاملA Free Software for the Development of Adaptive Automata
Although recent, adaptive technology is already being used to solve complex problems in areas such as compiler construction, natural language processing, computational vision and robotics. This papers introduces AdapTools, a free-software environment that helps the development of solutions based on adaptive automata. Since adaptive automata generalize finite state and structured pushdown automa...
متن کاملA linear time extension of deterministic pushdown automata
A linear time extension of deterministic pushdown automata is introduced that recognizes all deterministic context-free languages, but also languages such as {abc | n ≥ 0} and the MIX language. It is argued that this new class of automata, called λ-acyclic read-first deterministic stack+bag pushdown automata, has applications in natural language processing.
متن کاملA Logical Characterization for Dense-Time Visibly Pushdown Automata
Two of the most celebrated results that effectively exploit visual representation to give logical characterization and decidable modelchecking include visibly pushdown automata (VPA) by Alur and Madhusudan and event-clock automata (ECA) by Alur, Fix and Henzinger. VPA and ECA—by making the call-return edges visible and by making the clock-reset operation visible, respectively—recover decidabili...
متن کاملCellular Engineering
The main goal of this paper is to develop tools for constructing different kinds of abstract automata based on cellular automata. We call this engineering problem cellular engineering. Different levels of computing systems and models are considered. The emphasis is made on the toplevel model called a grid automaton. Our goal is to construct grid automata using cellular automata. To achieve this...
متن کامل